Deriving Grover's lower bound from simple physical principles
نویسندگان
چکیده
منابع مشابه
Deriving Acquisition Principles from Tutoring Principles
This paper describes our analysis of the literature on tutorial dialogues and presents a compilation of useful principles that students and teachers typically follow in making tutoring interactions successful. The compilation is done in the context of making use of those principles in building knowledge acquisition interfaces since acquisition interfaces can be seen as students acquiring knowle...
متن کاملDeriving the Qubit from Entropy Principles
We provide an axiomatization of the simplest quantum system, namely the qubit, based on entropic principles. Specifically, we show: The qubit can be derived from the set of maximumentropy probabilities that satisfy an entropic version of the Heisenberg uncertainty principle. Our formulation is in phase space (following Wigner [41]) and makes use of Rényi [32] entropy (which includes Shannon [33...
متن کاملDeriving Spatiotemporal Relations from Simple Data Structure
A spatiotemporal data model is incomplete without three components: classes, consistency constraints, and operators. Classes define the structure of the model, constraints enforce consistency in the model, and operators operate on the structure of the model. In the past, many models have been proposed, but most of them discussed the classes. The studies on operators for spatiotemporal data mode...
متن کاملA lower bound for disconnection by simple random walk
We consider simple random walk on Z, d ≥ 3. Motivated by the work of A.-S. Sznitman and the author in [21] and [22], we investigate the asymptotic behaviour of the probability that a large body gets disconnected from infinity by the set of points visited by a simple random walk. We derive asymptotic lower bounds that bring into play random interlacements. Although open at the moment, some of th...
متن کاملA simple lower bound on edge coverings by cliques
Assume that G = G(V, E) is an undirected graph with vertex set V and edge set E. A clique of G is a complete subgraph. An edge clique-covering is a family of cliques of G which cover all edges of G. The edge clique-cover number, Be( G), is the minimum number of cliques in an edge clique-cover of G. For results and applications of the edge clique-cover number see [1-4]. Observe that Be(G) does n...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: New Journal of Physics
سال: 2016
ISSN: 1367-2630
DOI: 10.1088/1367-2630/18/9/093047